An Affinity Propagation-Based DNA Motif Discovery Algorithm
نویسندگان
چکیده
منابع مشابه
An Affinity Propagation-Based DNA Motif Discovery Algorithm
The planted (l, d) motif search (PMS) is one of the fundamental problems in bioinformatics, which plays an important role in locating transcription factor binding sites (TFBSs) in DNA sequences. Nowadays, identifying weak motifs and reducing the effect of local optimum are still important but challenging tasks for motif discovery. To solve the tasks, we propose a new algorithm, APMotif, which f...
متن کاملDevelopment of an Efficient Hybrid Method for Motif Discovery in DNA Sequences
This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...
متن کاملAn Entropy-Based Position Projection Algorithm for Motif Discovery
Motif discovery problem is crucial for understanding the structure and function of gene expression. Over the past decades, many attempts using consensus and probability training model for motif finding are successful. However, the most existing motif discovery algorithms are still time-consuming or easily trapped in a local optimum. To overcome these shortcomings, in this paper, we propose an e...
متن کاملAn Improved PSO Clustering Algorithm Based on Affinity Propagation
-Particle swarm optimization (PSO) is undoubtedly one of the most widely used swarm intelligence algorithm. Generally, each particle is assigned an initial value randomly. In this paper an improved PSO clustering algorithm based on affinity propagation (APPSO) is proposed which provides new ideas and methods for cluster analysis. Firstly the proposed algorithm get initial cluster centers by aff...
متن کاملAn Efficient Algorithm for String Motif Discovery
Finding common patterns, motifs, in a set of DNA sequences is an important problem in bioinformatics. One common representation of motifs is a string with symbols A, C, G, T and N where N stands for the wildcard symbol. In this paper, we introduce a more general motif discovery problem without any weaknesses of the Planted (l,d)-Motif Problem and also a set of control sequences as an additional...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BioMed Research International
سال: 2015
ISSN: 2314-6133,2314-6141
DOI: 10.1155/2015/853461